Compiling Systemic Grammar into Feature Logicsystems 1

Although systemic grammars are represented declaratively (as system networks), the most important implementations to date have been committed to the generation direction , and seem more or less incomprehensible for the researcher not familiar with systemic descriptions and software. The aim of this paper is, therefore, to re-represent systemic grammar resources in a standard typed feature logic in order (1) to clarify theoretically the relation between systemic grammar and state-of-the-art feature logics, and (2) to serve as point of departure for bidirectional processing of systemic grammar. Four such representations in the feature logic formalisms ale, tfs, cuf and tdl are compared. Bidirectional processing in tfs and cuf based on type deduction are discussed.